28 research outputs found
Bisection of Bounded Treewidth Graphs by Convolutions
In the Bisection problem, we are given as input an edge-weighted graph G. The task is to find a partition of V(G) into two parts A and B such that ||A| - |B|| <= 1 and the sum of the weights of the edges with one endpoint in A and the other in B is minimized. We show that the complexity of the Bisection problem on trees, and more generally on graphs of bounded treewidth, is intimately linked to the (min, +)-Convolution problem. Here the input consists of two sequences (a[i])^{n-1}_{i = 0} and (b[i])^{n-1}_{i = 0}, the task is to compute the sequence (c[i])^{n-1}_{i = 0}, where c[k] = min_{i=0,...,k}(a[i] + b[k - i]).
In particular, we prove that if (min, +)-Convolution can be solved in O(tau(n)) time, then Bisection of graphs of treewidth t can be solved in time O(8^t t^{O(1)} log n * tau(n)), assuming a tree decomposition of width t is provided as input. Plugging in the naive O(n^2) time algorithm for (min, +)-Convolution yields a O(8^t t^{O(1)} n^2 log n) time algorithm for Bisection. This improves over the (dependence on n of the) O(2^t n^3) time algorithm of Jansen et al. [SICOMP 2005] at the cost of a worse dependence on t. "Conversely", we show that if Bisection can be solved in time O(beta(n)) on edge weighted trees, then (min, +)-Convolution can be solved in O(beta(n)) time as well. Thus, obtaining a sub-quadratic algorithm for Bisection on trees is extremely challenging, and could even be impossible. On the other hand, for unweighted graphs of treewidth t, by making use of a recent algorithm for Bounded Difference (min, +)-Convolution of Chan and Lewenstein [STOC 2015], we obtain a sub-quadratic algorithm for Bisection with running time O(8^t t^{O(1)} n^{1.864} log n)
Simultaneous Feedback Vertex Set: A Parameterized Perspective
Given a family of graphs , a graph , and a positive integer
, the -Deletion problem asks whether we can delete at most
vertices from to obtain a graph in . -Deletion
generalizes many classical graph problems such as Vertex Cover, Feedback Vertex
Set, and Odd Cycle Transversal. A graph ,
where the edge set of is partitioned into color classes, is called
an -edge-colored graph. A natural extension of the
-Deletion problem to edge-colored graphs is the
-Simultaneous -Deletion problem. In the latter problem, we
are given an -edge-colored graph and the goal is to find a set
of at most vertices such that each graph , where and , is in . In this work, we
study -Simultaneous -Deletion for being the
family of forests. In other words, we focus on the -Simultaneous
Feedback Vertex Set (-SimFVS) problem. Algorithmically, we show that,
like its classical counterpart, -SimFVS parameterized by is
fixed-parameter tractable (FPT) and admits a polynomial kernel, for any fixed
constant . In particular, we give an algorithm running in time and a kernel with vertices. The
running time of our algorithm implies that -SimFVS is FPT even when
. We complement this positive result by showing that for
, where is the number of vertices in the input graph,
-SimFVS becomes W[1]-hard. Our positive results answer one of the open
problems posed by Cai and Ye (MFCS 2014)
Galactic Token Sliding
International audienc
Combinatorial and Algorithmic Aspects of Monadic Stability
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory, generalize nowhere dense classes and close them under transductions, i.e. transformations defined by colorings and simple first-order interpretations. In this work we aim to extend some combinatorial and algorithmic properties of nowhere dense classes to monadically stable classes of finite graphs. We prove the following results.
- For every monadically stable class C and fixed integer s ? 3, the Ramsey numbers R_C(s,t) are bounded from above by ?(t^{s-1-?}) for some ? > 0, improving the bound R(s,t) ? ?(t^{s-1}/(log t)^{s-1}) known for the class of all graphs and the bounds known for k-stable graphs when s ? k.
- For every monadically stable class C and every integer r, there exists ? > 0 such that every graph G ? C that contains an r-subdivision of the biclique K_{t,t} as a subgraph also contains K_{t^?,t^?} as a subgraph. This generalizes earlier results for nowhere dense graph classes.
- We obtain a stronger regularity lemma for monadically stable classes of graphs.
- Finally, we show that we can compute polynomial kernels for the independent set and dominating set problems in powers of nowhere dense classes. Formerly, only fixed-parameter tractable algorithms were known for these problems on powers of nowhere dense classes